factorization of polynomials造句
例句與造句
- All these algorithms use the algorithms for factorization of polynomials over finite fields.
- As polynomials with coefficients in a modulo some prime number ( see Factorization of polynomials ).
- Modern techniques for factoring polynomials are fast and efficient, but use sophisticated mathematical ideas ( see Factorization of polynomials ).
- The rational root theorem is a special case ( for a single linear factor ) of Gauss's lemma on the factorization of polynomials.
- As factorization of polynomials may be difficult, a coarser decomposition is often preferred, which consists of replacing factorization by square-free factorization.
- It's difficult to find factorization of polynomials in a sentence. 用factorization of polynomials造句挺難的
- This makes essentially equivalent the problems of computing greatest common divisors and factorization of polynomials over the integers and of polynomials over the rational numbers.
- All algorithms which are presently implemented for factoring polynomials over the integers and over the rational numbers use this result ( see Factorization of polynomials ).
- When the coefficients belong to integers, rational numbers or a finite field, there are algorithms to test irreducibility and to compute the factorization into irreducible polynomials ( see Factorization of polynomials ).
- You also can think about adapting ideas mentioned in factorization of polynomials and perhaps use Gauss's lemma ( polynomial ) . talk ) 14 : 29, 23 March 2016 ( UTC)
- This algorithm produces a list of codewords ( it is a list-decoding algorithm ) and is based on interpolation and factorization of polynomials over GF ( 2 ^ m ) and its extensions.
- :See our articles on factorization of polynomials over a finite field and irreducibility tests, Berlekamp's algorithm, and Cantor Zassenhaus algorithm . talk ) 09 : 18, 9 April 2012 ( UTC)
- Two important and related problems in algebra are the factorization of polynomials, that is, expressing a given polynomial as a product of other polynomials that can not be factored any further, and the computation of polynomial greatest common divisors.
- For example, it can readily compute Gr鯾ner basis, syzygies and minimal free resolution, intersection, division, the radical of an ideal, the ideal of zero-dimensional schemes, Poincare series and Hilbert functions, factorization of polynomials, toric ideals.
- It is also defined over " F ", but has somewhat different properties : finding the form requires factorization of polynomials, and as a consequence the primary rational canonical form may change when the same matrix is considered over an extension field of " F ".
相鄰詞匯
- "factorization domain"造句
- "factorization into prime numbers"造句
- "factorization method"造句
- "factorization of polynomial"造句
- "factorization of polynomial over a finite field and irreducibility tests"造句
- "factorization of polynomials over a finite field and irreducibility tests"造句
- "factorization of polynomials over finite fields"造句
- "factorization of the mean"造句
- "factorization problem"造句
- "factorization system"造句